Most programs stop quickly or never halt
نویسندگان
چکیده
منابع مشابه
Most Programs Stop Quickly or Never Halt
The aim of this paper is to provide a probabilistic, but non-quantum, analysis of the Halting Problem. Our approach is to have the probability space extend over both space and time and to consider the probability that a random N -bit program has halted by a random time. We postulate an a priori computable probability distribution on all possible runtimes and we prove that given an integer k > 0...
متن کاملAuthor's Personal Copy Most Programs Stop Quickly or Never Halt
The aim of this paper is to provide a probabilistic, but non-quantum, analysis of the Halting Problem. Our approach is to have the probability space extend over both space and time and to consider the probability that a random N -bit program has halted by a random time. We postulate an a priori computable probability distribution on all possible runtimes and we prove that given an integer k > 0...
متن کاملJ an 2 00 7 Most Programs Stop Quickly or Never Halt
Since many real-world problems arising in the fields of compiler optimisation, automated software engineering, formal proof systems, and so forth are equivalent to the Halting Problem—the most notorious undecidable problem—there is a growing interest, not only academically, in understanding the problem better and in providing alternative solutions. Halting computations can be recognised by simp...
متن کامل6 Most short programs halt quickly
Since many real-world problems arising in the fields of compiler optimisation, automatised software engineering, formal proof systems, and so forth are equivalent to the Halting Problem—the most notorious undecidable problem—there is a growing interest, not only academically, in understanding the problem better and in providing alternative solutions. Halting computations can be recognised by si...
متن کاملCDMTCS Research Report Series Most Short Programs Halt Quickly
The aim of this paper is to provide a probabilistic, but non-quantum, analysis of the Halting Problem. Our approach is to have the probability space extend over both space and time and to consider the probability that a random N -bit program has halted by a random time. We postulate an a priori computable probability distribution on all possible runtimes and we prove that given an integer k > 0...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2008
ISSN: 0196-8858
DOI: 10.1016/j.aam.2007.01.001